Introducing VAUCANSON

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introducing VAUCANSON

This paper reports on a new software platform called Vaucanson and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures. The paper successively describes the main features of the Vaucanson platform, including the fact that the very rich data structure used to implement automa...

متن کامل

Inside Vaucanson

This paper presents some features of the Vaucanson platform. We describe some original algorithms on weighted automata and transducers (computation of the quotient, conversion of a regular expression into a weighted automaton, and composition). We explain how complex declarations due to the generic programming are masked from the user and finally we present a proposal for an XML format that all...

متن کامل

Boosting Vaucanson

Some of the work done in the last three years on the Vaucanson platform in order to enhance its performances is reported here. One is the functorization, a feature of C++ that proved to be rather disappointing. And the other is the implementation of automata via hash tables (as opposed to the implementation by adjency lists that was used fo far) and which proved to be really efficient.

متن کامل

Implementation Concepts in Vaucanson 2

Vaucanson is an open source C++ platform dedicated to the computation with finite weighted automata. It is generic: it allows to write algorithms that apply on a wide set of mathematical objects. Initiated ten years ago, several shortcomings were discovered along the years, especially problems related to code complexity and obfuscation as well as performance issues. This paper presents the conc...

متن کامل

On orthogonal specialization in C++ Dealing with efficiency and algebraic abstraction in Vaucanson

The Vaucanson library works on weighted finite state machines in an algebraic framework. As computing tools, FSMs must provide efficient services. Yet, abstraction is needed to obtain genericity but also to define properly what objects we are working on. Even if parameterized classes are a known solution to this problem, the different kinds of algorithm specializations are limited when using us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2004

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2004.07.007